منابع مشابه
Permutations with interval cycles
We study permutations of the set [n] = {1, 2, . . . , n} written in cycle notation, for which each cycle forms an increasing or decreasing interval of positive integers. More generally, permutations whose cycle elements form arithmetic progressions are considered. We also investigate the class of generalised interval permutations, where each cycle can be rearranged in increasing order to form a...
متن کاملCounting Stabilized-Interval-Free Permutations
A stabilized-interval-free (SIF) permutation on [n] = {1, 2, ..., n} is one that does not stabilize any proper subinterval of [n]. By presenting a decomposition of an arbitrary permutation into a list of SIF permutations, we show that the generating function A(x) for SIF permutations satisfies the defining property: [xn−1]A(x)n = n! . We also give an efficient recurrence for counting SIF permut...
متن کاملDecomposing Labeled Interval Orders as Pairs of Permutations
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. ...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملA characterization for all interval doubling schemes of the lattice of permutations
The lattice of all permutations on a -element set has been shown to be bounded [5], which is a strong constructive property characterized by the fact that admits what we call an interval doubling scheme. In this paper we characterize all interval doubling schemes of the lattice , a result that gives a nice precision on the bounded nature of the lattice of permutations. This theorem is a direct ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Music Theory Online
سال: 2013
ISSN: 1067-3040
DOI: 10.30535/mto.19.3.5